A Model-Theoretic Semantics of Integrity Constraints in Deductive Databases

ثبت نشده
چکیده

Conclusion We have developed the sustained model semantics for query answering and integrity checking in deductive databases. Several points have motivated this endeavor. First, it appeared as disturbing that, while most of today's semantics for query answering are three-valued, most semantics in the literature for answering the query if integrity is satisfied or violated are two-valued. After all, the answer "un-known" may make as much sense to the query about integrity as to any other query. Hence, we have developed a three-valued view of integrity which concedes that integrity may be neither violated nor satisfied in certain cases. Second, we found that most semantics for integrity are, in a sense, one-sided, by paying a higher attention to either satisfaction or violation. We have argued that an application-independent semantics for integrity should not be one-sided wrt conditions that ensure satisfaction (or, resp., violation) while being less concerned wrt the opposite. Rather, it should be left to the particular requirements of a given application to relax positions, for taking sides wrt weaker or stronger notions of satisfaction or violation of integrity, if necessary. This led to a refinement of our three-valued view, resulting in a non-biased two-valued semantics. The four possible cases that an integrity constraint is either satisfied by each sustained model, or only weakly satisfied by some sustained model, or that it is neither satisfied nor violated (hence weakly violated), or that it is violated in all sustained models, might even suggest to investigate a four-valued semantics for integrity. Third, there was a need to clarify the relationships between the traditional the-oremhood and consistency views of integrity [SK] and more recent proposals concerning database integrity in abductive logic programming [KM1] [KKT] [TK]. That need arose in the context of ongoing work on using abductive logic programming for knowledge assimilation in deductive databases [De5− 8]. To repeat, the starting point of this paper was a somehow uneasy feeling wrt the subtle diversity of existing proposals for capturing the meaning of integrity constraints. This paper is not the first in this regard. Similar observations have been made in [Re2]. However, the conclusions drawn in [Re2] lead into a direction which is different from ours. Reiter proposes to make the epistemic meta-level character of integrity constraints explicit by using a first-order calculus enhanced with modal operators. As opposed to that, my goal is to see how far model theory together with abductive logic …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Paraconsistency in the semantics of integrity constraints

Deductive databases are paraconsistent theory systems which change over time. They do not support the inference of arbitrary consequences from inconsistent components, such as contradictory definitions of database relations (predicates) or violated integrity constraints. Moreover, computed answers in deductive databases typically make sense, almost no matter to which degree consistency or integ...

متن کامل

the LMU München, where this paper was written. A preliminary version was

Deductive databases are paraconsistent theory systems which change over time. They do not support the inference of arbitrary consequences from inconsistent components, such as contradictory definitions of database relations (predicates) or violated integrity constraints. Moreover, computed answers in deductive databases typically make sense, almost no matter to which degree consistency or integ...

متن کامل

Intuitionistic Interpretation of Deductive Databases with Incomplete Information

Dong, F. and L.V.S. Lakshmanan, Intuitionistic interpretation of deductive databases with incomplete information, Theoretical Computer Science 133 (1994) 267-306. The aim of this paper is to build the relationship between deductive databases with incomplete information and hypothetical reasoning using embedded implications. We first consider the semantics of deductive databases with incomplete ...

متن کامل

A Model-based Semantics for Integrity in Deductive Databases

[DCe] Decker, Celma: A slick procedure for integrity checking in deductive databases , Proc.

متن کامل

Integrity Constraints as Views in Deductice Databases

In this paper we present a refutation procedure to compute goals in a deductive database according to particular views of it. Views are deened by a set of constraints rules. The declarative semantics of the constrained database is deened and the given refutation procedure is proved correct and complete for positive range{restricted databases. The extension of the procedure to deal with negation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997